Universal graph

Results: 68



#Item
11Variance of the subgraph count for sparse Erd˝ os-R´ enyi graphs Robert B. Ellis a,1,∗ , James P. Ferry b,1 a Department

Variance of the subgraph count for sparse Erd˝ os-R´ enyi graphs Robert B. Ellis a,1,∗ , James P. Ferry b,1 a Department

Add to Reading List

Source URL: math.iit.edu

Language: English - Date: 2009-09-14 16:32:12
12Explicit construction of universal structures Jan Hubiˇcka Charles University Prague Joint work with Jarik Nešetˇril

Explicit construction of universal structures Jan Hubiˇcka Charles University Prague Joint work with Jarik Nešetˇril

Add to Reading List

Source URL: www.ucw.cz

Language: English - Date: 2013-11-18 12:05:35
13Universality Homomorphism order Locally injective homomorphisms Locally injective homomorphisms are universal on connected graphs

Universality Homomorphism order Locally injective homomorphisms Locally injective homomorphisms are universal on connected graphs

Add to Reading List

Source URL: www.ucw.cz

Language: English - Date: 2013-11-18 11:55:01
14Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-01-27 11:28:33
15A GEOMETRIC ZERO-ONE LAW ROBERT H. GILMAN, YURI GUREVICH, AND ALEXEI MIASNIKOV Abstract. Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. If x is an element of X

A GEOMETRIC ZERO-ONE LAW ROBERT H. GILMAN, YURI GUREVICH, AND ALEXEI MIASNIKOV Abstract. Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. If x is an element of X

Add to Reading List

Source URL: www.math.stevens.edu

Language: English - Date: 2008-11-13 12:34:40
16An Optimal Ancestry Scheme and Small Universal Posets  ∗ Pierre Fraigniaud

An Optimal Ancestry Scheme and Small Universal Posets ∗ Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-04-12 08:36:10
17Sub-linear Universal Spatial Gossip Protocols? Herv´e Baumann1 and Pierre Fraigniaud1,2 1 University Paris Diderot 2

Sub-linear Universal Spatial Gossip Protocols? Herv´e Baumann1 and Pierre Fraigniaud1,2 1 University Paris Diderot 2

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-02-08 08:39:17
18Universal Augmentation Schemes Navigability: √ for Network ∗ Overcoming the n-Barrier Pierre Fraigniaud

Universal Augmentation Schemes Navigability: √ for Network ∗ Overcoming the n-Barrier Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-02-16 13:50:20
19Compact Ancestry Labeling Schemes for XML Trees∗ Pierre Fraigniaud† Abstract An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by

Compact Ancestry Labeling Schemes for XML Trees∗ Pierre Fraigniaud† Abstract An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-02-08 08:23:33
20On Universal Cycles of Labeled Graphs Greg Brockman Bill Kay  Harvard University

On Universal Cycles of Labeled Graphs Greg Brockman Bill Kay Harvard University

Add to Reading List

Source URL: www.gregbrockman.com

Language: English - Date: 2015-05-09 15:47:45